Integrate and Conquer

Divide-And-Conquer Sorting

Divide and Conquer

Process mining has been around for more than a decade now, and in that period several discovery and replay algorithms have been introduced that work fairly well on averagesized event logs. Nevertheless, these algorithms have problems dealing with big event logs. If the algorithms do not run out of memory, they will run out of time, because the problem handed to them is just too complex to be so...

Cooperate and Conquer ∗

The idea that cooperation can be a source of power has been extensively discussed in various disciplines. We study this idea from an economic viewpoint by analyzing the effect of intragroup cooperation in a static group rent-seeking model. Intragroup cooperation means that agents’ rent-seeking efforts maximize their group’s expected payoff. Although intragroup cooperation always reduces average...

Partition and Conquer

Although maps and partitions are ubiquitous in geographical information systems and spatial databases, there is only little work investigating their foundations. We give a rigorous definition for spatial partitions and propose partitions as a generic spatial data type that can be used to model arbitrary maps and to support spatial analysis. We identify a set of three powerful operations on part...

Divide and Conquer

An instance of the given problem is divided into easier instances of the same problem, which are solved recursively and then combined to create a solution to the original instance. Of course, divide and conquer is not suitable for every problem. A divide and conquer approach will only work if the problem is easily divided into a small number of easier sub-problems, and the solution to the entir...